String Matching Algorithms

Parallel String Matching Algorithms

String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.

Fast exact string matching algorithms

String matching is the problem of finding all the occurrences of a pattern in a text. We propose a very fast new family of string matching algorithms based on hashing q-grams. The new algorithms are the fastest on many cases, in particular, on small size alphabets. © 2007 Elsevier B.V. All rights reserved.

Algorithms for Transposition Invariant String Matching

The String Matching Algorithms Research Tool

String matching is the problem of finding all occurrences of a given pattern in a given text. It is an extensively studied problem in computer science because of its direct application to several areas such as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 85 string matching a...

Handbook of Exact String Matching Algorithms

Give us 5 minutes and we will show you the best book to read today. This is it, the handbook of exact string matching algorithms that will be your best choice for better reading book. Your five times will not spend wasted by reading this website. You can take the book as a source to make better concept. Referring the books that can be situated with your needs is sometime difficult. But here, th...